Quality of Service Analysis of Shared Buffer Management Policies Combined with Generalized Processor Sharing

نویسندگان

  • George Lapiotis
  • Shivendra Panwar
چکیده

An objective of the next. generation network is the accommodation of services wit,h different QoS requirements. This indicates that the network should provide special mechanisms in order to prioritize the access to network node resources, such as link capacity and buffer space. We studied the performance of sharing buffer space and link capacity bet.ween sessions, the traffic of which is modeled by independent. general Markov-Modulated Fluid Process (MMFP) sources. For scheduling we use the Generalized Processor Sharing ( G P S ) policy, and improve previous upper bounds on the queue occupancy distributions. As an example of combining G P S with buffer management we apply our results to complete buffer sharing with virtual partitioning (VP+GPS). We also derive results on the resource allocation trade-off, with applications in traffic management and admission control.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asymptotic Buffer Overflow Probabilities in Multiclass Multiplexers: An Optimal Control Approach

We consider a multiclass multiplexer with support for multiple service classes and dedicated buffers for each service class. Under specific scheduling policies for sharing bandwidth among these classes, we seek the asymptotic (as the buffer size goes to infinity) tail of the buffer overflow probability for each dedicated buffer. We assume dependent arrival and service processes as is usually th...

متن کامل

Asymptotic Buffer Overflow Probabilities in Multiclass Multiplexers , Part I : The GPS Policy 1 Dimitris

In this paper and its sequel [BPT96] we consider a multiclass multiplexer, with segregated buffers for each type of traffic. Under specific scheduling policies for sharing bandwidth, we seek the asymptotic (as the buffer size goes to infinity) tail of the buffer overflow probability for each buffer. We assume dependent arrival and service processes as it is usually the case in models of bursty ...

متن کامل

Network Multiplexer with Generalized Processor Sharing and Heavy-tailed On-Off Flows

We consider a set of fluid On-Off flows that share a common server of capacity c and a finite buffer B. The server capacity is divided using Generalized Processor Sharing scheduling discipline. Each flow has a minimum service rate guarantee that exceeds its long term average demand ρi. The buffer sharing is unrestricted as long as there is available space; if the buffer is full, the necessary a...

متن کامل

Call Admission Control Schemes under the Generalized Processor Sharing Scheduling

Provision of Quality-of-Service (QoS) guarantees is an important and challenging problem in the design of integrated-services packet networks. Call admission control is an integral part of the challenge and is closely related to other aspects of networks such as service models, scheduling disciplines, traffic characterization and QoS specification. In this paper we provide a theoretical framewo...

متن کامل

Policy Model for Sharing Network Slices in 5G Core Network

As mobile data traffic increases, and the number of services provided by the mobile network increases, service load flows as well, which requires changing in the principles, models, and strategies for media transmission streams serving to guarantee the given nature of giving a wide scope of services in Flexible and cost-effective. Right now, the fundamental question remains what number of netwo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004